Planar-DME: a single-layer zero-skew clock tree router
نویسندگان
چکیده
This paper presents new single-layer, i.e., planar-embeddable, clock tree constructions with exact zero skew under either the linear or the Elmore delay model. Our method, called Planar-DME, consists of two parts. The rst algorithm, called Linear-Planar-DME, guarantees an optimal planar zero-skew clock tree (ZST) under the linear delay model. The second algorithm, called ElmorePlanar-DME, uses the Linear-Planar-DME connection topology in constructing a low-cost ZST according to the Elmore delay model. While a planar ZST under the linear delay model is easily converted to a planar ZST under the Elmore model by elongating tree edges in bottom-up order, our key idea is to avoid unneeded wire elongation by iterating the DME construction of ZST and the bottom-up modi cation of the resulting non-planar routing. Costs of our planar ZST solutions are comparable to those of the best previous non-planar ZST solutions, and substantially improve over previous planar clock routing methods.
منابع مشابه
Planar-DME: A Single-Layer Zero-Skew Clock Tree Router - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
This paper presents new single-layer, i.e., planarembeddable, clock tree constructions with exact zero skew under either the linear or the Elmore delay model. Our method, called Planar-DME, consists of two parts. The first algorithm, called Linear-Planar-DME, guarantees an optimal planar zero-skew clock tree (ZST) under the linear delay model. The second algorithm, called Elmore-Planar-DME, use...
متن کاملUST/DME: a clock tree router for general skew constraints - Computer Aided Design, 2000. ICCAD-2000. IEEE/ACM International Conference on
In this paper, we propose new approaches for solving the usefulskew tree (UST) routing problem [17]: Clock routing subject to general skew constraints. The clock layout synthesis engine of our UST algorithms is based on the deferred-merge embedding (DME) paradigm for zero-skew tree [5; 11 and bounded-skew tree [8; 21 routings; hence, the names UST/DME and Greedy-UST/DME for our algorithms. They...
متن کاملRLC Clock Tree Construction Based on DME Algorithms Associated with Grey Relational Cluster
In this paper, we associate grey relational clustering with DME approach, called GDME, for solving the problem of clock tree construction. The experimental results show that our GDME improves up to 3.58% on total average in terms of total wire length than that of other DME algorithms. Additionally, our results of zero-skew RLC-based clock trees compared with Hspice are lower to 0.017% and 0.2% ...
متن کامل5 Conclusions and Directions for Future Work 4 Experimental Results
In the design of high performance VLSI systems, minimization of clock skew is an increasingly important objective. Additionally, wirelength of clock routing trees should be minimized in order to reduce system power requirements and deformation of the clock pulse at the synchronizing elements of the system. In this paper, we rst present the Deferred-Merge Embedding (DME) algorithm, which embeds ...
متن کاملAn automatic clock tree design system for high-speed VLSI designs: planar clock routing with the treatment of obstacles
1. Introduction: As digital Integrated Circuits (ICs) are driven at higher and higher clock frequencies, the need for a better clock net routing scheme has become essential. For complex ASICs (or VLSI), circuit designers ensure proper timing by carefully planning and implementing the distribution of clocks throughout the circuit. This part of the design process is critical because poor clock di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. on CAD of Integrated Circuits and Systems
دوره 15 شماره
صفحات -
تاریخ انتشار 1996